package day07;

/**
 * 数组的冒泡排序的实现
 *
 * @author Smartloe
 * @create 2021-04-28 18:32
 */
public class BubbleSort {
    public static void main(String[] args) {
        int[] arr = new int[]{-45, -56, 47, 85, 6, 4, 52, 25, 52, 66, 88};

        //冒泡排序
        for (int i = 0; i < arr.length - 1; i++) {
            for (int j = 0; j < arr.length - 1 - i; j++) {
                if (arr[j] > arr[j + 1]) {
                    int temp = arr[j];
                    arr[j] = arr[j + 1];
                    arr[j + 1] = temp;
                }
            }
        }


        for (int i = 0; i < arr.length; i++) {
            System.out.print(arr[i] + "\t");
        }
    }
}
